New Feature Correspondence Method using Bayesian Graph Matching Algorithm
نویسندگان
چکیده
In this paper, we propose a new approach for establishing the correspondence between local invariant features using Bayesian graph matching algorithm. First, we will discuss various local invariant feature detectors and descriptors for scale and affine transformation and illumination changes. Second, we propose an efficient features corresponding method using local invariant features and new graph matching algorithm. Finally, we evaluate the comparative performances of our method (BGMA) with several existing feature matching approach such as Lowe’s shift matching by conducting experiments on various real image data. We test on three image pairs taken from MSRC v2 dataset and Caltech 101 dataset. Experimental results show that the proposed method clearly outperforms rather than the existing matching algorithms about feature correspondence in images with rotation or scale transformation and illumination changes.
منابع مشابه
Optimal Feature Matching Method using Bayesian Graph Theory
Local feature matching is an essential component of many image and object retrieval algorithms. Feature similarities between object model and scene graph are complemented with a regularization term that measures differences of the relational structure. In this paper, we present a novel approach to the optimal feature matching using new Bayesian graph theory. First, we will discuss properties of...
متن کاملNon-rigid motion behaviour learning : a spectral and graphical approach
In this thesis graph spectral methods and kernel methods are combined together for the tasks of rigid and non-rigid feature correspondence matching and consistent labelling. The thesis is divided into five chapters. In Chapter 1 we give a brief introduction and an outline of the thesis. In Chapter 2 we review the main techniques in the literature which are related to the developments in this th...
متن کاملBayesian Point Set Matching of Scattering Featureswithapplication to Object Recognition
We present a statistical decision approach for the point set matching of unordered feature sets. Both feature sets have associated uncertainties, and the number of elements in each set may be different. Computation of the match likelihood requires a correspondence between feature sets; we solve the correspondence problem in polynomial time using the Hungarian algorithm. We also consider the pro...
متن کاملSubgraph Matching using Compactness Prior for Robust Feature Correspodence
Feature correspondence is widely formulated as a graph matching problem due to its robust performance under challenging conditions. A variety of fast and accurate algorithms have been proposed for graph matching. However, most of them focus on improving the recall of the solution while rarely considering its precision, thus inducing a solution with numerous outliers [1, 7]. To address both prec...
متن کاملBayesian Graph Edit Distance
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matching by Sanfeliu and Fu [1]. We show how the Levenshtein distance can be used to model the probability distribution for structural errors in the graph-matching problem. This probability distribution is used to locate mat...
متن کامل